A comparison of optimization solvers for log binomial regression including conic programming
نویسندگان
چکیده
Abstract Relative risks are estimated to assess associations and effects due their ease of interpretability, e.g., in epidemiological studies. Fitting log-binomial regression models allows use the coefficients directly infer relative risks. The estimation these models, however, is complicated because constraints which have be imposed on parameter space. In this paper we systematically compare different optimization algorithms obtain maximum likelihood estimates for regression. We first establish under conditions guaranteed finite unique, identify exclude problematic cases. simulation studies using artificial data performance optimizers including solvers based augmented Lagrangian method, interior-point methods a conic optimizer, majorize-minimize algorithms, iteratively reweighted least squares expectation-maximization algorithm variants. demonstrate that emerge as preferred choice reliability, lack requirement tune hyperparameters speed.
منابع مشابه
Robust portfolio optimization: a conic programming approach
The Markowitz Mean Variance model (MMV) and its variants are widely used for portfolio selection. The mean and covariance matrix used in the model originate from probability distributions that need to be determined empirically. It is well known that these parameters are notoriously difficult to estimate. In addition, the model is very sensitive to these parameter estimates. As a result, the per...
متن کاملOn the Estimation of Relative Risks via Log Binomial Regression
Given the well known convergence difficulties in fitting log binomial regression with standard GLM software, we implement a direct solution via constrained optimization which avoids the circumventions found in the literature. The use of a log binomial model is motivated by our interest in directly estimating relative risks adjusted for confounders. A Bayesian log binomial regression model is al...
متن کاملAdvances in convex optimization: conic programming
During the last two decades, major developments in convex optimization were focusing on conic programming, primarily, on linear, conic quadratic and semidefinite optimization. Conic programming allows to reveal rich structure which usually is possessed by a convex program and to exploit this structure in order to process the program efficiently. In the paper, we overview the major components of...
متن کاملA comparison of complete global optimization solvers
Results are reported of testing a number of existing state of the art solvers for global constrained optimization and constraint satisfaction on a set of over 1000 test problems in up to 1000 variables.
متن کاملApplication of Conic Optimization and Semidefinite Programming in Classification
In this paper, Conic optimization and semidefinite programming (SDP) are utilized and applied in classification problem. Two new classification algorithms are proposed and completely described. The new algorithms are; the Voting Classifier (VC) and the N-ellipsoidal Classifier (NEC). Both are built on solving a Semidefinite Quadratic Linear (SQL) optimization problem of dimension n where n is t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2021
ISSN: ['0943-4062', '1613-9658']
DOI: https://doi.org/10.1007/s00180-021-01084-5